package codetop.dp;

public class Code718 {
    public int findLength(int[] nums1, int[] nums2) {
        int len1=nums1.length;
        int len2=nums2.length;
        int [][]dp=new int[len1+1][len2+1];
        int max=0;
        for (int i = 1; i <len1+1 ; i++) {
            for (int j = 1; j <len1+1 ; j++) {
                if (nums1[i-1]==nums2[j-1]){
                    dp[i][j]=1+dp[i-1][j-1];
                    max=Math.max(max,dp[i][j]);
                }
            }
        }
        return max;
    }

}
